package com.wry.wry_test.algorithm;

public class Day04 {


    public String longestPalindrome(String s) {
        return null;

    }

    private String getReverseStr(int pivot, int start, int end, char[] chars) {

        while (start >= 0 && end <= chars.length - 1) {
            if (chars[start] != chars[end]) {
                break;
            }
            start--;
            end++;
        }

        return "";
    }


}
